Trade-off results for connection management

Trade-Off Results for Connection Management

Abs t rac t . A connection management protocol establishes a connection between two hosts across a wide-area network to allow reliable message delivery. Following previous work of Kleinberg et al. (Proceedings of the 3rd Israel Symposium on the Theory of Computing and Systems, pp. 258-267, January 1995), we study the precise impact of the behavior of processors' clocks with respect to real time...

Some Trade-off Results for Polynomial Calculus

We present size-space trade-offs for the polynomial calculus (PC) and polynomial calculus resolution (PCR) proof systems. These are the first true size-space trade-offs in any algebraic proof system, showing that size and space cannot be simultaneously optimized in these models. We achieve this by extending essentially all known size-space trade-offs for resolution to PC and PCR. As such, our r...

A simplified way of proving trade-off results for resolution

We present a greatly simplified proof of the length-space trade-off result for resolution in Hertel and Pitassi (2007), and also prove a couple of other theorems in the same vein. We point out two important ingredients needed for our proofs to work, and discuss possible conclusions to be drawn regarding proving trade-off results for resolution. Our key trick is to look at formulas of the type F...

Uncertainty trade-off and disturbance trade-off for quantum measurements

An important non-classical feature of quantum measurements is the celebrated uncertainty trade-off, namely that the uncertainties in the outcomes of measurements performed on distinct yet identically prepared ensembles of systems cannot all be made arbitrarily small. Recently, we have shown that quantum measurements also exhibit another non-classical feature of disturbance trade-off namely, tha...

Secret-Public Storage Trade-Off for Broadcast Encryption Key Management